Executable Matrix Operations on Matrices of Arbitrary Dimensions
نویسندگان
چکیده
We provide the operations of matrix addition, multiplication, transposition, and matrix comparisons as executable functions over ordered semirings. Moreover, it is proven that strongly normalizing (monotone) orders can be lifted to strongly normalizing (monotone) orders over matrices. We further show that the standard semirings over the naturals, integers, and rationals, as well as the arctic semirings satisfy the axioms that are required by our matrix theory. Our formalization was performed as part of the IsaFoR/CeTA-system [3] which contains several termination techniques. The provided theories have been essential to formalize matrix-interpretations [1] and arctic interpretations [2]. A short description of this formalization can be found in [4].
منابع مشابه
Matrices in ACL2
This paper describes some initial work on a formalization of matrices in ACL2. The current work is focused on creating an executable implementation that is simple to mechanically reason with and complete enough to be capable of analyzing real problems in linear algebra. A number of basic operations have been defined including matrix addition, transposition and multiplication by a scalar, a vect...
متن کاملSome rank equalities for finitely many tripotent matrices
A rank equality is established for the sum of finitely many tripotent matrices via elementary block matrix operations. Moreover, by using this equality and Theorems 8 and 10 in [Chen M. and et al. On the open problem related to rank equalities for the sum of finitely many idempotent matrices and its applications, The Scientific World Journal 2014 (2014), Article ID 702413, 7 page...
متن کاملOn the powers of fuzzy neutrosophic soft matrices
In this paper, The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied. We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM. ...
متن کاملActions for spinor fields in arbitrary dimensions
We are going to give a systematic presentation of spinors in various spacetime dimensions which is a prerequisite for understanding the supersymmetry. (For general reviews see [1,2,3].) To set up the conventions, we will consider in what follows the Dirac matrices that satisfy the following Clifford algebra {γ, γ} = 2η1 , η = diag(+ · · ·+,− · · ·−) , (1) the sign +, − appear t, s times which a...
متن کاملGauss-Jordan Algorithm and Its Applications
In this contribution, we present a formalization of the well-known Gauss-Jordan algorithm. It states that any matrix over a field can be transformed by means of elementary row operations to a matrix in reduced row echelon form. The formalization is based on the Rank Nullity Theorem entry of the AFP and on the HOL-Multivariate-Analysis session of Isabelle, where matrices are represented as funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010